Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex $$p$$ p -centre problems
نویسندگان
چکیده
منابع مشابه
Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex p-centre problems
Large-scale unconditional and conditional vertex p-centre problems are solved using two meta-heuristics. One is based on a three-stage approach whereas the other relies on a guided multi-start principle. Both methods incorporate Variable Neighbourhood Search, exact method, and aggregation techniques. The methods are assessed on the TSP dataset which consist of up to 71,009 demand points with p ...
متن کاملAn adaptive multiphase approach for large unconditional and conditional p-median problems
A multiphase approach that incorporates demand points aggregation, Variable Neighbourhood Search (VNS) and an exact method is proposed for the solution of large-scale unconditional and conditional p-median problems. The method consists of four phases. In the first phase several aggregated problems are solved with a “Local Search with Shaking” procedure to generate promising facility sites which...
متن کاملhybrid harmony search for conditional p-median problems
in this paper the conditional location problem is discussed. conditional location problems have a wide range of applications in location science. a new meta-heuristic algorithm for solving conditional p-median problems is proposed and results are compared to those of the previous studies. this algorithm produces much better results than the previous formulations.
متن کاملHybrid P System with Conditional Communication
The feature of conditional communication in membrane computing has been introduced in symbol objects and arrays in [1, 8, 9, 19]. Hybridity and context free is a special feature which has been applied on Hybrid P system [17]. In this paper we study the nature of membrane computing with conditional communication in Hybrid context free puzzle P system and examine the power of the system by compar...
متن کاملComparing Three Proposed Meta-heuristics to Solve a New p-hub Location-allocation Problem
This paper presents a new mathematical model, in which the location of hubs is fixed and their capacity is determined based on facilities and factories allocated to it. In order to feed the client's nodes, different types of vehicles of different capacities are considered, in which the clients are allocated to hubs, and types and numbers of vehicles are allocated to the factory's facilities. To...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Heuristics
سال: 2015
ISSN: 1381-1231,1572-9397
DOI: 10.1007/s10732-014-9277-7